A combinatorial trace method: Counting closed walks to assay graph eigenvalues
نویسندگان
چکیده
منابع مشابه
Counting Closed Walks and Spanning Trees in Graphs via Linear Algebra and Matrices 1 Adjacency Matrices and Counting Closed Walks
The material of this section is based on Chapter 1 of Richard Stanley’s notes “Topics in Algebraic Combinatorics”, which can be found at http://math.mit.edu/∼rstan/algcomb.pdf. Recall that an m-by-n matrix is an array of numbers (m rows and n columns), and we can multiply an mby-n matrix and an n-by-p matrix together to get an m-by-p matrix. The resulting matrix has entries obtained by taking e...
متن کاملClosed walks and eigenvalues of Abelian Cayley graphs
We show that Abelian Cayley graphs contain many closed walks of even length. This implies that given k 3, for each > 0, there exists C = C( , k) > 0 such that for each Abelian group G and each symmetric subset S of G with 1 / ∈ S, the number of eigenvalues λi of the Cayley graph X =X(G,S) such that λi k − is at least C · |G|. This can be regarded as an analogue for Abelian Cayley graphs of a th...
متن کاملCounting quadrant walks via Tutte’s invariant method
In the 1970s, Tutte developed a clever algebraic approach, based on certain “invariants”, to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks confined to the first quadrant is governed by similar equations, and has led in the past decade to a rich collection of attractive results dealing with the nature (algebr...
متن کاملReferences on Higher Laplacian Eigenvalues and Combinatorial Graph Properties
This is a collection of references for a series of lectures that I gave in the “boot camp” of the semester on spectral graph theory at the Simons Institute in August, 2014. To keep this document focused, I only refer to results related to the lectures in question, which means that my own work is disproportionally represented. I plan to post a better version of this document in the future, so pl...
متن کاملEigenvalues of the Cayley Graph of Some Groups with respect to a Normal Subset
Set X = { M11, M12, M22, M23, M24, Zn, T4n, SD8n, Sz(q), G2(q), V8n}, where M11, M12, M22, M23, M24 are Mathieu groups and Zn, T4n, SD8n, Sz(q), G2(q) and V8n denote the cyclic, dicyclic, semi-dihedral, Suzuki, Ree and a group of order 8n presented by V8n = < a, b | a^{2n} = b^{4} = e, aba = b^{-1}, ab^{...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2013
ISSN: 0035-7596
DOI: 10.1216/rmj-2013-43-2-469